Semantic Optimization of Preference Queries
نویسنده
چکیده
Preference queries are relational algebra or SQL queries that contain occurrences of the winnow operator (find the most preferred tuples in a given relation). We present here a number of semantic optimization techniques applicable to preference queries. The techniques make it possible to remove redundant occurrences of the winnow operator and to apply a more efficient algorithm for the computation of winnow. We also study the propagation of integrity constraints in the result of the winnow. We have identified necessary and sufficient conditions for the applicability of our techniques, and formulated those conditions as constraint satisfiability problems.
منابع مشابه
Semantic Optimization Techniques for Preference Queries
Preference queries are relational algebra or SQL queries that contain occurrences of the winnow operator (find the most preferred tuples in a given relation). Such queries are parameterized by specific preference relations. Semantic optimization techniques make use of integrity constraints holding in the database. In the context of semantic optimization of preference queries, we identify two fu...
متن کاملDeveloping a BIM-based Spatial Ontology for Semantic Querying of 3D Property Information
With the growing dominance of complex and multi-level urban structures, current cadastral systems, which are often developed based on 2D representations, are not capable of providing unambiguous spatial information about urban properties. Therefore, the concept of 3D cadastre is proposed to support 3D digital representation of land and properties and facilitate the communication of legal owners...
متن کاملPreference Queries with SV-Semantics
Personalization of database queries requires a semantically rich, easy to handle and flexible preference model. Building on preferences as strict partial orders we provide a variety of intuitive base preference constructors for numerical and categorical data, including so-called d-parameters. As a novel semantic concept for complex preferences we introduce the notion of ‘substitutable values’ (...
متن کاملOptimization of Preference Queries with Multiple Constraints
Nowadays, the efficient integration of preference querying into standard database technology is an important issue. In some instances, preference queries challenge traditional query processing and optimization. In this paper we study preference database queries involving hard constraints over multiple attributes belonging to several relations. The main bottleneck for such queries is the computa...
متن کاملTransformation of TCP-Net Queries into Preference Database Queries
TCP-nets are a popular approach within the AI community for preference handling. Concurrently, within the database community lots of work has been done to integrate preference handling into database query languages like Preference SQL, building on a variety of preference constructors under a strict partial order semantics. Moreover, many sophisticated algebraic optimization techniques and prefe...
متن کامل